Planar and non-planar topologically consistent vector map simplification
نویسندگان
چکیده
منابع مشابه
Planar and non-planar topologically consistent vector map simplification
This article contains a mathematical analysis of strategies for determining topological consistency of vector map simplifications. Such techniques exploit assumptions that can be made regarding the similarity of corresponding objects in successive simplifications. We propose that all topological relationships may be classified as planar or non-planar. A formal analysis of techniques for determi...
متن کاملHardware-Assisted View-Dependent Planar Map Simplification
In this paper, we present an algorithm and a system to perform dynamic view dependent simplification of large geographical maps through a novel use of graphics hardware. Given a map as a collection of non-intersecting chains and a tolerance parameter for each chain, we produce a simplified map that resembles the original map, satisfying the condition that the distance between each point on the ...
متن کاملMap Building in Planar and Non-Planar Environments
Mapping environments is a fundamental task for a rescue robot. In this paper we present techniques that we have developed for mapping rescue environments within the SPQR-Rescue team participating in the RoboCup 2004 Real Rescue competition. After an analysis of existing techniques for simultaneous localization and mapping (SLAM) we have devised a method suitable for planar environment (i.e. yel...
متن کاملSimultaneous & topologically-safe line simplification for a variable-scale planar partition
We employ a batch generalization process for obtaining a variable-scale planar partition. We describe an algorithm to simplify the boundary lines after a map generalization operation (either a merge or a split operation) has been applied on a polygonal area and its neighbours. The simplification is performed simultaneously on the resulting boundaries of the new polygonal areas that replace the ...
متن کاملNon-planar Extensions of Planar Graphs
A graph G is almost 4-connected if it is simple, 3-connected, has at least ve vertices, and V (G) cannot be partitioned into three sets A;B;C in such a way that jCj = 3, jAj 2, jBj 2, and no edge of G has one end in A and the other end in B. A graph K is a subdivision of a graph G if K is obtained from G by replacing its edges by internally disjoint nonzero length paths with the same ends, call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Geographical Information Science
سال: 2011
ISSN: 1365-8816,1362-3087
DOI: 10.1080/13658816.2010.545062